Hyper-heuristics: an Emerging Direction in Modern Search Technology

نویسندگان

  • Edmund Burke
  • Emma Hart
  • Graham Kendall
  • Jim Newall
  • Peter Ross
  • Sonia Schulenburg
چکیده

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than current meta-heuristic technology which tends to be customised to a particular problem or a narrow class of problems. Hyperheuristics are broadly concerned with intelligently choosing the right heuristic or algorithm in a given situation. Of course, a hyper-heuristic can be (often is) a (meta-)heuristic and it can operate on (meta-)heuristics. In a certain sense, a hyper-heuristic works at a higher level when compared with the typical application of meta-heuristics to optimisation problems i.e. a hyper-heuristic could be thought of as a (meta)-heuristic which operates on lower level (meta)heuristics. In this chapter we will introduce the idea and give a brief history of this emerging area. In addition, we will review some of the latest work to be published in the field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling

This paper investigates an emerging class of search algorithms, in which high-level domain independent heuristics, called hyperheuristics, iteratively select and execute a set of application specific but simple search moves, called low-level heuristics, working toward achieving improved or even optimal solutions. Parallel architectures have been designed and evaluated. Results based on a univer...

متن کامل

Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

In this paper we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions step by step. Based on these sequences, we statistically analyse the way in which graph colouring heuris...

متن کامل

A Choice Function based hyper-heuristic for Multi-objective Optimization

Hyper-heuristics are emerging methodologies that perform a search over the space of heuristics to solve difficult computational optimization problems. There are two main types of hyper-heuristics: selective and generative hyper-heuristics. An online selective hyper-heuristic framework manages a set of low level heuristics and aims to choose the best one at any given time using a performance mea...

متن کامل

Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics

A square matrix of distinct numbers in which every row, column and both diagonals has the same total is referred to as a magic square. Constructing a magic square of a given order is considered as a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high level search methodologies that explore the space of heuristics for solving ...

متن کامل

Hyper-heuristics: Raising the Level of Generality

Hyper-heuristics are easy-to-implement emerging search and optimisation strategies which have been used instead of meta-heuristics for providing higher level generalized structures to solve mainly combinatorial optimisation problems. The motivation behind them is generally expressed as raising the level of generality. That is, they are the answers to the following question: How can we create or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003